| Description |
1 online resource (xxvi, 314 pages) : illustrations |
| Series |
Annals of discrete mathematics ; 57 |
|
Annals of discrete mathematics ; 57.
|
| Bibliography |
Includes bibliographical references and index. |
| Contents |
Cover; Contents; Foreword 2004; Foreword; Preface; Acknowledgments; List of Symbols; Corrections and Errata; Chapter 1. Graph Theoretic Foundations; Chapter 2. The Design of Efficient Algorithms; Chapter 3. Perfect Graphs; Chapter 4. Triangulated Graphs; Chapter 5. Comparability Graphs; Chapter 6. Split Graphs; Chapter 7. Permutation Graphs; Chapter 8. Interval Graphs; Chapter 9. Superperfect Graphs; Chapter 10. Threshold Graphs; Chapter 11. Not So Perfect Graphs; Chapter 12. Perfect Gaussian Elimination; Appendix; Epilogue 2004; Index. |
| Summary |
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph. |
| Subject |
Perfect graphs.
|
|
Graphes parfaits. |
|
Perfect graphs |
|
Grafentheorie. |
|
Teoria dos grafos. |
|
Computabilidade e complexidade. |
|
Programação matemática. |
|
Programação inteira e fluxos em rede. |
| Other Form: |
Print version: Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. 2nd ed. Amsterdam ; Boston : Elsevier, 2004 0444515305 9780444515308 (DLC) 2004555477 (OCoLC)55081039 |
| ISBN |
9780080526966 (electronic bk.) |
|
0080526969 (electronic bk.) |
|
0444515305 |
|
9780444515308 |
|
More Resources